Checking Sets, Test Sets, Rich Languages and Commutatively Closed Languages
نویسندگان
چکیده
منابع مشابه
Parikh test sets for commutative languages
A set T ⊆ L is a Parikh test set of L iff c(T ) is a test set of c(L). We give an effective characterization of Parikh test sets for arbitrary commutative language.
متن کاملOptimal Test Sets for Context-Free Languages
A test set for a formal language (set of strings) L is a subset T of L such that for any two string homomorphisms f and g defined on L, if the restrictions of f and g on T are identical functions, then f and g are identical on the entire L. Previously, it was shown that there are context-free grammars for which smallest test sets are cubic in the size of the grammar, which gives a lower bound o...
متن کاملOn Test Sets for Checking Morphism Equivalence on Languages with Fair Distribution of Letters
A test set for ;t language I. is J tinite subset T of L with the property that each pair of morphisms that agrees on 7 iilso agrees on L. Some results concerning te\t sets for languages with f,rir distribution of letters ilre presented. The first result is that every DOL language with fair distribution of Ictters has ,i test cet. The second result shows thst every lapage L with fair distributio...
متن کاملIndex Sets in Modeling Languages
Index-sets are an integral and fundamental part of every mathematical modeling language. They assist the modeler in grouping various objects and entities. Indexsets are also used extensively in the mathematical notation in order to write an expression in a concise way. An example is the sigma notation for formulating the summation of an unknown positive number n of terms. In this paper, the con...
متن کاملSymbolic Model Checking with Rich ssertional Languages
The paper shows that, by an appropriate choice of a rich as-sertional language, it is possible to extend the utility of symbolic model checking beyond the realm of bdd-represented nite-state systems into the domain of innnite-state systems, leading to a powerful technique for uniform veriication of unbounded (parameterized) process networks. The main contributions of the paper are a formulation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1983
ISSN: 0022-0000
DOI: 10.1016/0022-0000(83)90022-3